Most probable explanations in Bayesian networks: Complexity and tractability
نویسنده
چکیده
An overview is given of definitions and complexity results of a number of variants of the problem of probabilistic inference of the most probable explanation of a set of hypotheses given observed phenomena.
منابع مشابه
Tractability of most probable explanations in multidimensional Bayesian network classifiers
Multidimensional Bayesian network classifiers have gained popularity over the last few years due to their expressive power and their intuitive graphical representation. A drawback of this approach is that their use to perform multidimensional classification, a generalization of multi-label classification, can be very computationally demanding when there are a large number of class variables. Th...
متن کاملAbstraction for Ef ciently Computing Most Probable Explanations in Bayesian Networks
ion for Ef ciently Computing Most Probable Explanations in Bayesian Networks Ole J. Mengshoel Carnegie Mellon University NASA Ames Research Center Mail Stop 269-3 Moffett Field, CA 94035 [email protected]
متن کاملReasoning MPE to Multiply Connected Belief Networks Using Message Passing
Finding the I Most Probable IJxplanations (MPE) of a given evidence, Se, in a Bayesian belief network is a process to identify and order a set of composite hypotheses, His, of which the posterior probabilities are the I largest; i.e., Pr(Hii&) 2 Pr(H21&) 2 . . . L Pr(&ISlz)~ A composite hypothesis is defined as an instantiation of all the non-evidence variables in the network. It could be shown...
متن کاملA recurrence local computation approach towards ordering composite beliefs in bayesian belief networks
Finding the l Most Probable Explanations (MPE) of a given evidence, S e , in a Bayesian belief network can be formulated as identifying and ordering a set of composite hypotheses, H i s, of which the posterior probabilities are the l largest; i.e., Pr(H 1 jS e) ::: Pr(H l jS e). When an order includes all the composite hypotheses in the network in order to nd all the probable explanations, it b...
متن کاملStructure Approximation of Most Probable Explanations in Bayesian Networks
Abstract Typically, when one discusses approximation algorithms for (NP-hard) problems (like TRAVELING SALESPERSON, VERTEX COVER, KNAPSACK), one refers to algorithms that return a solution whose value is (at least ideally) close to optimal; e.g., a tour with almost minimal length, a vertex cover of size just above minimal, or collection of objects that has close to maximal value. In contrast, o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 52 شماره
صفحات -
تاریخ انتشار 2011